/**
 * @file Scanner.h
 * @author  Aljosa Osep <aljosa.osep@gmail.com, Marjan Mernik, Vilijem Zumer>
 * @version 1.0
 *
 * @section LICENSE
 *
 * Redistribution and use in source and binary forms, with or without modification, are
 * permitted provided that the following conditions are met:

 *  1. Redistributions of source code must retain the above copyright notice, this list of
 *    conditions and the following disclaimer.

 *  2. Redistributions in binary form must reproduce the above copyright notice, this list
 *     of conditions and the following disclaimer in the documentation and/or other materials
 *     provided with the distribution.

 * THIS SOFTWARE IS PROVIDED BY <Aljosa Osep> ``AS IS'' AND ANY EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL <Aljosa Osep>> OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 * The views and conclusions contained in the software and documentation are those of the
 * authors and should not be interpreted as representing official policies, either expressed
 * or implied, of <Aljosa Osep>.
 *
 * @section DESCRIPTION
 *
 * Scanner definition
 * Breaks input into tokens, based on finite state maschine
 * Based on code sample from FERI lessons
 * Original authors: Marjan Mernik, Vilijem Zumer. Thanks!
 */

#ifndef __SCANNER_H
#define __SCANNER_H

#include "token.h"

#define MAX_STATE 6
#define START_STATE 0  // initial state
#define NO_EDGE -1  // no edge state
#define RESERWED_WORDS 7 // number of reserwed words

class Scanner
{
private:
    string input; // string to parse
    Token lastToken; // last read token
    int row, column;  // current row and column
    int automata[MAX_STATE+1][256]; // all states table
    int finite[MAX_STATE+1]; // table of finite states
    string reswdWords[RESERWED_WORDS]; // reserwed words list

    virtual void initAutomat();  // inicializacija tabele prehodov in tabele koncnih stanj

    bool isReservedWord(string s); // check wheter string is a reserwed word or not

    int getNextState(int aState, int aChar) const; // get next state  based on current character and read character


    bool isFiniteState(int aState) const; // is state finite?
    int getFiniteState(int aState) const;
    
    int read(); // read next character
    bool eof();
    int peek();




    // poisci naslednji osnovni leks. simbol
public:
    // ctor
    Scanner(string input);
    Scanner();

    void setInput(string _input);

    Token nextTokenImp();
    Token nextToken();
    Token currentToken();
};

#endif
